A Dynamic Channel Assignment Algorithm: A Cellular Learning Automata Approach
نویسنده
چکیده
IrUl"Odu("lioll of micro-cellular net.works offer a pot.ent.ial increa.c;e in capacity of cellular net.works, but. they nc'all' pl"ll"ll'lII~ ill III it.splf bv usin!!; t.he proposp.ci c.hannel a.c;signmp.nt. alj!;orithm a t.hp. net.work operat.p.s.
منابع مشابه
A Self-Organizing Channel Assignment Algorithm: A Cellular Learning Automata Approach
Introduction of micro-cellular networks offer a potential increase in capacity of cellular networks, but they create problems in management of the cellular networks. A solution to these problems is self-organizing channel assignment algorithm with distributed control. In this paper, ''le first introduce the model of cellular learning automata in which learning automata are used to adjust the st...
متن کاملSt Reading Cellular Learning Automata Based Dynamic Channel Assignment Algorithms 5
17 A solution to channel assignment problem in cellular networks is self-organizing channel assignment algorithm with distributed control. In this paper, we propose three cellu-19 lar learning automata based dynamic channel assignment algorithms. In the first two algorithms, no information about the status of of channels in the whole network will 21 be used by cells for channel assignment where...
متن کاملCellular Learning Automata Based Dynamic Channel Assignment Algorithms
A solution to channel assignment problem in cellular networks is self-organizing channel assignment algorithm with distributed control. In this paper, we propose three cellular learning automata based dynamic channel assignment algorithms. In the first two algorithms, no information about the status of channels in the whole network will be used by cells for channel assignment whereas in the thi...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملA Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...
متن کامل